Abstract: The First-In-First-Out or First Come First Serve (FCFS) job scheduling technique is a non-preemptive scheduling technique often used in many hardware, software and production systems. For improvement of parameters such as reduction of waiting time in queue and turnaround time, a version of FCFS is developed with a dynamic time slice allocation technique based on job length. The same dynamic time slice allocation technique is used to improve the standard preemptive round-robin priority-based job scheduling technique. Finally, this paper endeavours to attempt a comparative study between the FCFS job scheduling technique with dynamic time slice allocation, and the pre-emptive priority-based job scheduling technique with dynamic time slice allocation, both of which offer better performances than their standard static time slice allocation-based variants.

Keywords: Dynamic time slice allocation, FCFS, Priority Scheduling, Round Robin, Turnaround time reduction.